Extremal graphs without 4-cycles
نویسندگان
چکیده
منابع مشابه
Extremal graphs without 4-cycles
We prove an upper bound for the number of edges a C4-free graph on q 2 + q vertices can contain for q even. This upper bound is achieved whenever there is an orthogonal polarity graph of a plane of even order q. Let n be a positive integer and G a graph. We define ex(n,G) to be the largest number of edges possible in a graph on n vertices that does not contain G as a subgraph; we call a graph o...
متن کاملExtremal graphs without three-cycles or four-cycles
We derive bounds for f(v), the maximum number of edges in a graph on v vertices that contains neither three-cycles nor four-cycles. Also, we give the exact value of f(v) for all v up to 24 and constructive lower bounds for all v up to 200.
متن کاملOn the girth of extremal graphs without shortest cycles
Let EX (ν; {C3, . . . ,Cn}) denote the set of graphs G of order ν that contain no cycles of length less than or equal to n which have maximum number of edges. In this paper we consider a problem posed by several authors: does G contain an n + 1 cycle? We prove that the diameter of G is at most n − 1, and present several results concerning the above question: the girth of G is g = n + 1 if (i) ν...
متن کاملMoore Graphs and Cycles Are Extremal Graphs for Convex Cycles
Let ρ(G) denote the number of convex cycles of a simple graph G of order n, size m, and girth 3 ≤ g ≤ n. It is proved that ρ(G) ≤ ng (m−n+ 1) and that equality holds if and only if G is an even cycle or a Moore graph. The equality also holds for a possible Moore graph of diameter 2 and degree 57 thus giving a new characterization of Moore graphs.
متن کامل4-critical Graphs on Surfaces without Contractible (<=4)-cycles
We show that if G is a 4-critical graph embedded in a fixed surface Σ so that every contractible cycle has length at least 5, then G can be expressed as G = G′ ∪ G1 ∪ G2 ∪ . . . ∪ Gk, where |V (G′)| and k are bounded by a constant (depending linearly on the genus of Σ) and G1, . . . , Gk are graphs (of unbounded size) whose structure we describe exactly. The proof is computer-assisted—we use co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2013
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2013.01.001